Skip to content

Alice B. - Earth#21

Open
aliceboone wants to merge 3 commits intoAda-C14:masterfrom
aliceboone:master
Open

Alice B. - Earth#21
aliceboone wants to merge 3 commits intoAda-C14:masterfrom
aliceboone:master

Conversation

@aliceboone
Copy link

Heaps Practice

Congratulations! You're submitting your assignment!

Comprehension Questions

Question Answer
How is a Heap different from a Binary Search Tree? Binary Search Tree doesn’t allow duplicates, however, the Heap does
Could you build a heap with linked nodes? Yes
Why is adding a node to a heap an O(log n) operation? Elements are always added to the leaves and you traverse only one side.
Were the heap_up & heap_down methods useful? Why? Yes. It's a best practice that when you perform an action over and over.

Copy link

@CheezItMan CheezItMan left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Nice work Alice, you hit the learning goals here. Well done.

Comment on lines +4 to 6
# Time Complexity: O(n log n)
# Space Complexity: O(n)
def heap_sort(list)

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍

Comment on lines +17 to 19
# Time Complexity: O(log n)
# Space Complexity: O(1)
def add(key, value = key)

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Since heap_up is recursive the space complexity is O(log n)

Comment on lines +28 to 30
# Time Complexity: O(log n)
# Space Complexity: O(log n)
def remove()

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍

Comment on lines +58 to 60
# Time complexity: O(1)
# Space complexity: O(1)
def empty?

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍

Comment on lines +69 to 71
# Time complexity: O(log n)
# Space complexity: O(log n)
def heap_up(index)

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍

# This helper method takes an index and
# moves it up the heap if it's smaller
# than it's parent node.
def heap_down(index)

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍 Nice work!

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants